Note on terminal-pairability in complete grid graphs
نویسندگان
چکیده
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gyárfás, and Lehel (1999). © 2017 Elsevier B.V. All rights reserved.
منابع مشابه
Extremal solutions to some art gallery and terminal-pairability problems
The thesis consists of two parts. In both parts, the problems studied are of significant interest, but are either NP-hard or unknown to be polynomially decidable. Realistically, this forces us to relax the objective of optimality or restrict the problem. As projected by the title, the chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis ...
متن کاملOn Path-pairability in the Cartesian Product
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open que...
متن کاملLinkedness and Path-Pairability in the Cartesian Product of Graphs
In this dissertation I summarize my work in the field of linkedness and pathpairability of graphs with primary focus on the inheritance of the mentioned properties in the Cartesian product of graphs. We obtain a general additive inheritance bound for linkedness. We determine the exact linkedness number of hypercubes, as well as affine and projective grids of arbitrary dimensions. Similar inheri...
متن کاملDC Voltage Control and Power-Sharing of Multi-Terminal DC Grids Based on Optimal DC Power Flow and Flexible Voltage Droop Strategy
This paper develops an effective control framework for DC voltage control and power-sharing of multi-terminal DC (MTDC) grids based on an optimal power flow (OPF) procedure and the voltage-droop control. In the proposed approach, an OPF algorithm is executed at the secondary level to find optimal reference of DC voltages and active powers of all voltage-regulating converters. Then, the voltage ...
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017